CLTs and asymptotic variance of time-sampled Markov chains
نویسندگان
چکیده
Abstract: For a Markov transition kernel P and a probability distribution μ on nonnegative integers, a time-sampled Markov chain evolves according to the transition kernel Pμ = ∑ k μ(k)P k. In this note we obtain CLT conditions for time-sampled Markov chains and derive a spectral formula for the asymptotic variance. Using these results we compare efficiency of Barker’s and Metropolis algorithms in terms of asymptotic variance.
منابع مشابه
On Variance Conditions for Markov Chain Clts
The existence of central limit theorems (CLTs) for Markov chains is well studied, and is is particularly important for Markov chain Monte Carlo (MCMC) algorithms, see e.g. [13], [23], [8], [5], [6], [10], [12], and [9]. In particular, the asymptotic variance σ is very important in applications, and various alternate expressions for it are available in terms of limits, autocovariances, and spect...
متن کاملCovariance Ordering for Discrete and Continuous Time Markov Chains
The covariance ordering, for discrete and continuous time Markov chains, is defined and studied. This partial ordering gives a necessary and sufficient condition for MCMC estimators to have small asymptotic variance. Connections between this ordering, eigenvalues, and suprema of the spectrum of the Markov transition kernel, are provided. A representation of the asymptotic variance of MCMC estim...
متن کاملImproving Asymptotic Variance of MCMC Estimators: Non-reversible Chains are Better
I show how any reversible Markov chain on a finite state space that is irreducible, and hence suitable for estimating expectations with respect to its invariant distribution, can be used to construct a non-reversible Markov chain on a related state space that can also be used to estimate these expectations, with asymptotic variance at least as small as that using the reversible chain (typically...
متن کاملAsymptotic Variance of Passage Time Estimators in Markov Chains
We consider the problem of estimating passage times in stochastic simulations of Markov chains+ Two types of estimator are considered for this purpose: the “simple” and the “overlapping” estimator; they are compared in terms of their asymptotic variance+ The analysis is based on the regenerative structure of the process and it is shown that when estimating the mean passage time, the simple esti...
متن کاملA Regeneration Proof of the Central Limit Theorem for Uniformly Ergodic Markov Chains
Abstract Central limit theorems for functionals of general state space Markov chains are of crucial importance in sensible implementation of Markov chain Monte Carlo algorithms as well as of vital theoretical interest. Different approaches to proving this type of results under diverse assumptions led to a large variety of CTL versions. However due to the recent development of the regeneration t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011